| 1. | If a, b, and c are distinct and {a, b, c} is a set of indiscernibles, then, for example, for each binary formula β {\displaystyle \beta } , we must have ∨ . {\displaystyle \lor \,.} Historically, the identity of indiscernibles was one of the laws of thought of Gottfried Leibniz.
Si a, b et c sont distincts et {a, b, c} est un « ensemble d'indiscernables », pour chaque formule binaire φ, on doit alors avoir ∨ . |
